Pentagon Identity Revisited

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Biometric Identity Based Signature Revisited

In this paper, we describe a new biometric Identity Based Signature (IBS) scheme based on the Sakai Kasahara Key Construction and prove its security in the framework of a stronger security model compared to exisiting adversarial models. Besides, we present a new type of a denial of service (DoS) attack and evaluate existing biometric IBS schemes in this context. Based on the recently defined pr...

متن کامل

Henrici’s Friendly Monster Identity Revisited

We revisit Peter Henrici’s friendly monster identity to present a case study on Egorychev’s method. Connections to various computer algebra approaches are drawn.

متن کامل

Online/Offline Identity-Based Signcryption Revisited

In this paper, we redefine a cryptographic notion called Online/Offline Identity-Based Signcryption. It is an “online/offline” version of identity-based signcryption, where most of the computations are carried out offline while the online part does not require any heavy computations such as pairings or multiplications on elliptic curve. It is particularly suitable for power-constrained devices ...

متن کامل

Galindo-Garcia Identity-Based Signature Revisited

In Africacrypt 2009, Galindo-Garcia [11] proposed a lightweight identity-based signature (IBS) scheme based on the Schnorr signature. The construction is simple and claimed to be the most efficient IBS till date. The security is based on the discrete-log assumption and the security argument consists of two reductions: B1 and B2, both of which use the multiple-forking lemma [4] to solve the disc...

متن کامل

Jhanwar-Barua's Identity-Based Encryption Revisited

In FOCS’07, Boneh, Gentry and Hamburg presented an identity-based encryption (IBE) system (BasicIBE) based on the quadratic residuosity (QR) assumption. A BasicIBE encryption of an l-bit message has a short ciphertext of log2 N +2l bits where N is a Blum integer. However, it is not time-efficient due to solving l+1 equations in the formRx+ Sy ≡ 1 (mod N). Jhanwar and Barua presented a variant o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2011

ISSN: 1687-0247,1073-7928

DOI: 10.1093/imrn/rnr200